SAI method for solving job shop sequencing problem under certain and uncertain environment
نویسندگان
چکیده
منابع مشابه
Classical Center Location Problem Under Uncertain Environment
This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...
متن کاملA Constraint Program for Solving the Job-Shop Problem
In this paper, a method within the framework of propagation of interval constraints and based on the branch-and-bound optimization scheme for solving the job-shop scheduling problem will be presented. The goal is to provide a constraint program which is clean, exible and robust. The design of the constraint program is based on an idea of sorting the release and due dates of tasks, which is a su...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملSIMD architecture for job shop scheduling problem solving
Job shop is a typical environment for manufacturing highvariety and low-volume discrete parts. Good scheduling is critical and challenging to the competitiveness of job shops. The Lagrangian relaxation neural network (LRNN) developed by [I] , provides an approach of quantifiable quality and successful industrial applications. To further speed up scheduling for large-scale problems, in this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sri Lankan Journal of Applied Statistics
سال: 2017
ISSN: 2424-6271,1391-4987
DOI: 10.4038/sljastats.v18i3.7911